Shiftable Intervals
نویسندگان
چکیده
Let a set of n fixed length intervals and a set of n (larger) windows, in one-to-one correspondence with the intervals, be given, and assume that each interval can be placed in any position within its window. If the position of each interval has been fixed, the intersection graph of such set of intervals is an interval graph. By varying the position of each interval in all possible ways, we get a family of interval graphs. In the paper we define some optimization problems related to the clique, stability, chromatic, clique cover numbers and cardinality of the minimum dominating set of the interval graphs in the family, mainly focussing on complexity aspects, bounds and solution algorithms. Some problems are proved to be NP-hard, others are solved in polynomial time on some particular classes of instances, which are characterized in the paper. Many practical applications can be reduced to these kind of problems, suggesting the use of Shiftable Intervals as a new interesting modeling framework.
منابع مشابه
ShifTable: A Natural Remote Target-Selection Technique on Large Displays
To simplify the selection of remote targets on large displays, a novel technique called ShifTable is presented in this paper. With ShifTable, users move a finger or a pen towards a desired target, and the whole screen carrying the target shifts faster in the opposite direction, towards the finger or pen. We conducted two experiments to compare ShifTable with unaided direct selection (baseline),...
متن کاملShiftable multiscale transforms
Orthogonal wavelet transforms have recently become a popular representation for multi-scale signal and image analysis. One of the major drawbacks of these representations is their lack of translation invariance: the content of wavelet subbands is unstable under translations of the input signal. Wavelet transforms are also unstable with respect to dilations of the input signal, and in two dimens...
متن کاملFiltering algorithms using shiftable kernels
It was recently demonstrated in [4] that the non-linear bilateral filter [18] can be efficiently implemented using an O(1) or constanttime algorithm. At the heart of this algorithm was the idea of approximating the Gaussian range kernel of the bilateral filter using trigonometric functions. In this letter, we explain how the idea in [4] can be extended to few other linear and non-linear filters...
متن کاملSidestep: Co-Designed Shiftable Memory & Software
Sidestep: Co-Designed Shiftable Memory & Software T. Kelly, H. Kuno, M.D. Pickett, H. Boehm, A. Davis, W. Golab, G. Graefe, S. Harizopoulos, P. Joisha, A. Karp, N. Muralimanohar, F. Perner, G. Medeiros-Ribeiro, G. Seroussi, A. Simitsis, R. Tarjan, R.S. Williams HP Laboratories HPL-2012-235
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Annals OR
دوره 150 شماره
صفحات -
تاریخ انتشار 2000